Method of tracking time intervals for a communication signal

ABSTRACT

An improved tracking system, illustrated as a delayed lock loop. The time intervals of a communication signal are tracked by first sampling the communication signal. A standard and a sample, advanced relative to each other by i sample positions from a sample position representing an assumed arrival position t a  of a time interval, are correlated over a correlating length of k samples. Also, the standard and a sample retarded relative to each other by the i sample positions from the assumed arrival time t a  are also correlated over k samples. A timing error is determined from the correlations. A predication of the arrival time t p  of the next interval is determined from the error. One or more of the correlation length k or the i sample position is modified based on the predicated arrival time t p . The process is repeated using any of the modified correlation length k and/or sample position i. The timing error may also be used for descrambling and despreading.

BACKGROUND AND SUMMARY OF THE INVENTION

The present invention relates generally to a method of tracking time intervals of a communication signal and, more specifically, to an improved delayed lock loop (DLL) method. Although the present invention will be described with respect to Code-Division Multiple Access (CDMA) systems, which is a coding scheme that requires them to be synchronized with the coding scheme in the processing, it is applicable to other signal transmissions.

In a CDMA transmission, each station's data stream is multiplied by binary bits, for example, pseudo noise (PN) codes. In order to decode the data stream at the receiver, the received signal must be correlated with the same PN codes. The received signal is subject to transmission delays and fading. If there are multi-path components, rake receivers are used, which correlate each of the multi-path components and recombine them. Thus, the transmission delay and fading of each rake receiver finger must be determined.

In addition to matching the appropriate PN codes, it is necessary to track the transmission delay of the components, as it may vary. Two of the predominant PN tracking configurations used are DLL and Tau-Dither Loop (TDL). Both are early-late gate-type loops where the received PN code is correlated with delayed and advanced versions of the receiver local code PN generator output to produce an error correcting characteristics.

Two typical examples are illustrated in FIGS. 1 and 2. The input signal is provided to an early and late correlator, which correlates the input sample signal to a PN code-generated signal. The output is provided through an output detector to a difference element. The difference or error is provided through a low pass filter (LPF) to a voltage control oscillator (VCO), which changes the phase of the PN generator. The output of the PN generator is the on-time PN sequence. The other example illustrated in FIG. 2 performs generally the same process, except that it adjusts the delay of the data to account for the difference or error. The input signal is provided through a variable delay, which is connected to the early correlator, the late correlator and an on-time correlator. The results are provided to accumulators, which is provided to a decision circuitry. The off-set or error is computed and provided through a loop filter to a delay adjust, which adjusts the variable delay input of the sampled, received signal or data.

These delayed lock loops or correlators are run for a fixed correlation length, and the sample position or time of the early and late correlators compared to the on-time correlators are generally fixed. This leads to a large number of calculations and consumption of power.

The present invention offers an improved tracking system, illustrated as a delayed lock loop. The time intervals of a communication signal are tracked by first sampling the communication signal. A standard and a sample, advanced relative to each other by i sample positions from an assumed sample position representing the assumed arrival position t_(a) of a time interval, are correlated over a correlating length of k samples. Also, the standard and a sample, retarded relative to each other by the i sample positions from the assumed sample position of t_(a), are also correlated over k samples. A timing error is determined from the correlations. A prediction of the predicted arrival time t_(p); of the next interval is determined from the error. One or more of the correlation length k or the i sample position is modified based on the predicted arrival time t_(p). The process is repeated using any of the modified correlation length k and/or sample position i.

The method of determining the correlation error includes calculating an estimated arrival time t_(o) of the present interval. This estimated arrival time t_(o) is used to predict the next arrival time t_(p). The estimated time t_(o) is a function of the magnitude and the spacing of the maximum and minimum error. The prediction of the next arrival time t_(p) includes setting the assumed arrival time t_(a) to the previous assumed arrival time t_(a), if the predicted arrival time t_(p) differs from the previous assumed arrival time t_(a) by less than a given value. The next assumed arrival time t_(a) is set to the previous assumed arrival time t_(a) plus or minus an increment, if the predicted arrival time t_(p) differs from the previous assumed arrival time to by more than a given value. Preferably, the estimated arrival times t_(o) are passed through a predictor type filter, and the results are used to predict the next arrival time t_(p).

The correlation length k may be in a range of 256 to 2048 samples and may be modified by a range of 32 to 128 samples. The correlation length k will be changed depending upon whether the variance of the estimated arrival time t_(o) from the assumed arrival time t_(a) is within or without a tolerance window. The tolerance levels correspond to the AWGN noise variances.

The method also includes determining if the error is above a threshold. If it is above a threshold, then the data samples timing of standard is interpolated, and the interpolated timing is used to decode the communication signal. If it is not above the threshold, the standard timing is used to decode the communication signal. The method may be used with CDMA communication signals and may be used in rake receivers for each finger. Time intervals may be frames, slots or other time intervals of a communication signal. Preferably, the method is carried out in a software implementation on a signal processor.

These and other aspects of the present invention will become apparent from the following detailed description of the invention, when considered in conjunction with accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a delayed lock loop of a prior art.

FIG. 2 is a block diagram of another delayed lock loop of a prior art.

FIG. 3 is a flow chart of the method of tracking time intervals according to the principles of the present invention.

FIG. 4A is a graph of the correlation error of a received signal.

FIG. 4B is a graph of the received signal.

FIG. 5 depicts three graphs of the unfiltered assumed arrival time t_(a), predicted arrival time t_(p) and the moving average of the assumed next arrival time t_(a) as a function of number samples.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 3 shows a flow diagram for tracking time intervals of a communication signal. The inputs at 10 to the correlators 12 are data or signals x_(e,l)[nT_(s)] and standard c*[mT_(s)]. The input signal or data x_(e,l)[nT_(s)] may be a complex sequence, for example, in-phase (I) and quadrature (Q) components of a communication signal, for example, CDMA. The standard c*[mT_(s)] is the complex conjugate of c[mT_(s)] which is a PN sequence of the transmission. T_(s) is the sampling time, and n is the data or sample number.

The late complex correlator and an early complex correlator 12 correlate over a correlation length k. The start position or the amount of the early and/or late from the time position t_(a) is i. As will be described below, the advance or retard position i is changed depending upon the correlation error, as is the correlation length k. Reducing the start position i and the correlation length k allows substantial savings in time and power required to perform the correlations. The correlators of step 12 are well-known and not described in detail. The correlations y_(l)[nT_(s)] and y_(e)[nT_(s)] are then used to calculate the correlation error Z[nT_(s)] at 14. This is an absolute value subtraction.

Next, the correlation error is Z[nT_(s)] used to calculate an estimate of the arrival time t_(o) of the current time interval. FIG. 4B illustrates an example of the actual analog signal. As illustrated in FIG. 4A, the correlation error proceeds vacillating around zero until it reaches a Max(C[nT_(s)]) shown at approximately time 15 within the interval. This is followed by a Min(C[nT_(s)]) shown at approximately time 21 within the interval. In between, there is an estimated arrival time t_(o) of the present interval which is the time of zero correlation error. The assumed arrival time of the current interval t_(a), as shown in FIG. 4A, is the sampling time position. The sample error is the difference between the assumed arrival time t_(a) and the estimated arrival time t_(o).

The estimated present arrival time t_(o) may be calculated as follows: $t_{o} = {\frac{- {{Max}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)}}{{{Min}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)} - {{Max}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)}}\left\lbrack {{{Position}\left( {{{Min}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)} - {{Position}\left( {{Max}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)} \right)}} \right\rbrack} + {{Position}\left( {{Max}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)} \right)}} \right\rbrack}$

The estimated arrival time t_(o) of the present interval from 16 is provided to build a statistical data base at 20. Statistical data base 20 consists of determining the variants of the estimated arrival time t_(o) over a specific number of intervals. This may be, for example, ten time intervals. Each new estimated arrival time t_(o) produces new variance and a new mean value. Next, it is determined whether the variance σ² is in tolerance at 22. If it is not, the correlation length k is modified at 24 and provided to the correlators at 12. One method of determining if the variants σ² is in tolerance and modifying k is as follows:

k=k+αN

where N is the increment of the correlation length k and α is defined as follows:

α = 0 for σ₁ ² ≦ σ² ≦ σ₂ ² α = −1 for σ² ≦ σ₁ ² α = +1 for σ² ≧ σ₂ ²

where σ₁ ² and σ₂ ² are specified variance thresholds.

The thresholds of σ₁ ² and σ₂ ² correspond to AWGN noise variances. For example, σ₁ ² may equal 0.0018, and σ₂ ² may equal 0.0062, which corresponds to the AWGN noise variances 0.5 and 1, respectively. The correlation length k may be in the range of 256 to 2048 samples, and the increment N may be in the range of 32 to 128 samples.

The estimated present arrival time t_(o) is also used to predict the next interval arrival time t_(p) and to establish the starting position i or the amount of advance or retard at 26 for the correlates 12 from an assumed sample time position t_(a). Part of the prediction of the next interval arrival time t_(p) at 26 includes passing the estimated present arrival times t_(o) through predictive type filters, one step predictors or Kalman predictors. The results are then used to predict the next arrival time t_(p). One method of predicting arrival time t_(p) is using the methods described in A. Papoulis, Probability, Random Variables, and Stochastic Processes, McGraw-Hill, Inc., 1991, 14.2.

Once the next arrival time t_(p) is predicted, the early/late correlation starting point i is determined. Depending on the difference of the predicted next arrival time t_(p) the present assumed arrival time t_(a), the value of the starting points i may be changed or the assumed arrival time t_(a) for the next interval can be changed. Using FIG. 4A as an example, if the predicted next arrival time t_(p) is closer to time position 17 that the present assumed arrival time t_(a) of 18 and the original starting point i was 3, the starting point i could be increased to 4 such that at least the total separation of 6 is maintained about the time position 17 or the assumed arrival time t_(a) may be changed from 18 to 17 and i stays at 3.

The timing error t_(a)-t_(o) is also used in demodulation. The timing error is tested to see if it is greater than a percentage of the sample time T_(s). If it is not greater, then the assume arrival time t_(a) is used to descramble and despread starting with the nearest sample at 32. If it is greater, then an interpolation is performed at 34, and the interpolated time is used to descramble and despread at 36. For example, if the assumed arrival time t_(a) is 18 and the timing error is beyond the pre-set limit, the start time may be increment by 0.5 and set to 18.5. The limit may be, for example, 25 percent of the sampling time T_(s). Interpolation may be performed using one of the different methods described by E. Kreyszig in Advanced Engineering Mathematics, John Willey and Sons, 1972, 18.4.

FIG. 5 illustrates the unfiltered assumed arrival time t_(a) compared to the predicted arrival time t_(p). The graph of the moving average of the assumed arrival time t_(a) is provided to show the quality of the predicted zero time t_(o).

The present method is performed in software on known devices and delayed lock loops.

Although the present invention has been described and illustrated in detail, it is to be clearly understood that this is done by way of illustration and example only and is not to be taken by way of limitation. The spirit and scope of the present invention are to be limited only by the terms of the appended claims. 

What is claimed:
 1. A method for tracking time intervals of a communication signal, the method comprising: sampling the communication signal at a rate of T_(s); correlating, over correlating length k samples, a standard and a sample advanced relative to each other by i sample positions from an assumed sample position representing an assumed arrival time t_(a) of a time interval; correlating, over k samples, the standard and a sample retarded relative to each other by the i sample positions from the assumed time t_(a); determining a timing error from the correlations; predicting, from the error, a predicted arrival time t_(p) of the next interval; modifying one or more of k and i based on the predicted arrival time t_(p); and performing the correlating and subsequent steps using any of the modified k and i.
 2. The method according to claim 1, where determining the error includes calculating an estimated arrival time t_(o) of the current time interval; and using the estimated arrival time t_(o) to predict the next arrival time t_(p).
 3. The method according to claim 2, wherein the estimated arrival time t_(o) is calculated as follows: $t_{o} = {\frac{- {{Max}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)}}{{{Min}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)} - {{Max}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)}}\left\lbrack {{{Position}\left( {{{Min}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)} - {{Position}\left( {{Max}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)} \right)}} \right\rbrack} + {{Position}\left( {{Max}\left( {Z\left\lbrack {nT}_{s} \right\rbrack} \right)} \right)}} \right\rbrack}$

wherein Z[nT_(s)] is the correlation error.
 4. The method according to claim 2, wherein predicating the next arrival time t_(p) includes setting the next assumed arrival time t_(a) to the present assumed arrival time t_(a) if the present predicted arrival time t_(p) differs from the assumed arrival time t_(a) by less than a given value.
 5. The method according to claim 4, wherein predicating the next arrival time t_(p) includes setting the next assumed arrival time t_(a) to the present assumed arrival time t_(a) plus or minus an increment if the predicted arrival time t_(p) differs from the present assumed arrival time t_(a) by more than the given value; and using the next assumed arrival time t_(a) for correlating.
 6. The method according to claim 2, wherein the present estimated arrival times t_(o) are passed through a predictor type filter, one step predictor or Kalman predictor, and the results are used to predict the next arrival time t_(p).
 7. The method according to claim 1, wherein the correlation length k is in the range of 256 to 2048 samples and is modified by a range of 32 to 128 samples.
 8. The method according to claim 2, wherein the correlation length k will be changed as follows: k=k+αN where N is the increment of the correlation length k, and α is defined as follows: α = 0 for σ₁ ² ≦ σ² ≦ σ₂ ² α = −1 for σ² ≦ σ₁ ² α = +1 for σ² ≧ σ₂ ²

where σ² is the variance of the estimated arrival time t_(o), and σ₁ ² and σa₂ ² are specified variance thresholds.
 9. The method according to claim 8, wherein σ₁ ² and σ₂ ² correspond to AWGN noise variances.
 10. The method according to claim 1, wherein the standard for the correlation is a pseudo noise code.
 11. The method according to claim 1, wherein the communication signal is CDMA.
 12. The method according to claim 1, wherein the method is performed in a rake receiver for each finger.
 13. The method according to claim 1, including determining if the error is above a threshold; interpolating the data samples timing of the standard if the error is above the threshold; and using the timing of the standard or the timing of the interpolated standard, if interpolated, to decode the communication signal.
 14. The method according to claim 13, wherein the threshold is a percentage of the sampling rate T_(s).
 15. The method according to claim 1, wherein the interval is one of a frame or slot of a communication signal.
 16. A receiver performing the method of claim
 1. 17. The receiver of claim 16, wherein the receiver includes software for performing the method of claim
 1. 